Scheduling Imprecise Tasks in Real-Time Distributed Systems
نویسندگان
چکیده
The Imprecise Computation technique has been proposed as an approach to the construction of real-time systems that are able to provide both guarantee and flexibility. This paper analyzes the utilization of Imprecise Computation in the scheduling of distributed real-time applications. First we discuss the main problems associated with that goal, and we define a task model suitable to distributed environments. Then, this paper presents an approach to the scheduling of distributed imprecise tasks. Finally, we describe specific scheduling algorithms to be used within the proposed approach.
منابع مشابه
On Scheduling Imprecise Tasks in Real-Time Distributed Systems
The Imprecise Computation technique has been proposed as an approach to the construction of real-time systems that are able to provide both guarantee and flexibility. This paper analyzes the use of Imprecise Computation in the scheduling of distributed real-time applications. Initially it is presented an approach to the scheduling of distributed imprecise tasks. Then we discuss the main problem...
متن کاملAdaptive Fixed Priority End-To-End Imprecise Scheduling In Distributed Real Time Systems
In end-to-end distributed real time systems, a task may be executed sequentially on different processors. The end-toend task response time must not exceed the end-to-end task deadline to consider the task a schedulable task. In transient over load periods, deadlines may be missed or processors may saturate. The imprecise computation technique is a way to overcome the mentioned problems by tradi...
متن کاملEscalonamento de tarefas imprecisas em ambiente distribuído
Real-time computing systems are defined as those systems subjected to timing constraints. In those systems, results must be not only logically correct but they also must be generated at the right moment. A basic problem one finds when building a distributed real time system is the allocation and scheduling of tasks on the available computing resources. There is an intrinsic difficulty in simult...
متن کاملA Fast Algorithm for Scheduling Imprecise Computations with Timing Constraints to Minimize Weighted Error
Scheduling tasks with dflerent weights in the imprecise computation model is rather dflcult. Each task in the imprecise computation model is logically decomposed into a mandatory subtask and an optional subtask. The mandatory subtask must be completely executed before the deadline to produce acceptable result; the optional subtask begins after the mandatory subtask to refine the result. The err...
متن کاملSafety Verification of Real Time Systems Serving Periodic Devices
In real-time systems response to a request from a controlled object must be correct and timely. Any late response to a request from such a device might lead to a catastrophy. The possibility of a task overrun, i.e., missing the deadline for completing a requested task, must be checked and removed during the design of such systems. Safe design of real-time systems running periodic tasks under th...
متن کامل